Ideal Two-Machine Schedules of Jobs with Unit-Execution-Time Operations: An Extended Abstract
نویسندگان
چکیده
Ideal schedules minimize both maximum completion time and total completion time of jobs. This paper presents polynomial-time algorithms finding ideal nonpreemptive and preemptive two-machine schedules of jobs with arbitrary release dates and precedence constraints and unit-execution-time operations on identical parallel machines, in a flow shop and an open shop. Heretofore, the complexity status of these problems has been unknown.
منابع مشابه
An Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion ...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملAdaptive Job Scheduling for a Service Grid Using a Genetic Algorithm
This paper presents a new approach to scheduling jobs on a service Grid using a genetic algorithm (GA). A fitness function is defined to minimize the average execution time of scheduling N jobs to M(≤ N) machines on the Grid. Two models are proposed to predict the execution time of a single job or multiple jobs on each machine with varied system load. The single service type model is used to sc...
متن کاملAn Eecient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
We give a new eecient approximation algorithm for scheduling precedence constrained jobs on machines with diierent speeds. The setting is as follows. There are n jobs 1; : : : ; n where job j requires pj units of processing. The jobs are to be scheduled on a set of m machines. Machine i has a speed si; it takes pj=si units of time for machine i to process job j. The precedence constraints on th...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کامل